A greedy switch-box router
نویسنده
چکیده
منابع مشابه
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on different sides. The results drawn from our system of linear Diophantine equations based formulation turn out to be general. We prove that the divideand-conquer (reduction) design methodology can also be applied to t...
متن کاملCompiling Logical Packet Programs to Reconfigurable Switches: Table Mapping as a First Step
Today’s fixed-function switch chips result in new features taking years to develop, and in routers being designed bottom-up. This is changing with the emergence of software designed networks (SDNs), new chips such as Intels FlexPipe that allow flexible packet processing, and higher level languages for expressing packet processing such as P4. However, this vision requires compilers that translat...
متن کاملNot Necessarily More Switches More Routability
It has been observed experimentally that the mapping of global to detailed routing in conventional FPGA routing architecture (2D array) yields unpredictable results. In [8,10,13], a different class of FPGA structures called Greedy Routing Architectures (GRAs), where a locally optimal switch box routing can be extended to an optimal entire chip routing, were investigated. It was shown that GRAs ...
متن کاملDetailed Routing of Multi-Terminal Nets in FPGAs
We present a multi-terminal routing algorithm for fieldprogrammable gate arrays (FPGAs). The routing problem for the FPGAs is dificult due to the preplaced routing segments that can be connected only by the pre-existing switches. We describe a sequential router that routes multiterminal nets in a single stage, i.e., global routing is not required. The multi-terminal routing greatly reduces the ...
متن کاملFLSAC: A new scheme to defend against greedy behavior in wireless mesh networks
The most commonly used medium access mechanism in wireless mesh networks is based on the CSMA/CA protocol. This protocol schedules properly the access to the medium among all the competing nodes. However, in a hostile environment, such as wireless mesh networks (WMNs), selfish or greedy behaving nodes may prefer to decline the proper use of the protocol rules in order to increase their bandwidt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Integration
دوره 3 شماره
صفحات -
تاریخ انتشار 1985